On spanning tree congestion
نویسندگان
چکیده
We prove that every connected graph G of order n has a spanning tree T such that for every edge e of T the edge-cut defined in G by the vertex sets of the two components of T − e contains at most n 32 many edges which solves a problem posed by Ostrovskii (Minimal congestion trees, Discrete Math. 285 (2004), 219-226.)
منابع مشابه
On Spanning Tree Congestion of Product Graphs
In this paper we consider the spanning tree congestion for several families of graphs. We find the exact spanning tree congestion for toroidal meshes, Cm×Cn, and cylindrical meshes, Pm×Cn,. Also we find bounds for the spanning tree congestion of Qn, and a construction that gives the upper bound.
متن کاملOn spanning tree congestion of Hamming graphs
We present a tight lower bound for the spanning tree congestion of Hamming graphs.
متن کاملSpanning Tree Congestion of Planar Graphs
The paper is devoted to estimates of the spanning tree congestion for some planar graphs. The main results of the paper: (1) We almost determined (up to ±1) the maximal possible spanning tree congestion for planar graphs. (2) The value of congestion indicator introduced in Ostrovskii [Discrete Math. 310 (2010), no. 6–7, 1204–1209] can be very far from the value of the spanning tree congestion. ...
متن کاملSpanning tree congestion of rook's graphs
Let G be a connected graph and T be a spanning tree of G. For e ∈ E(T ), the congestion of e is the number of edges in G joining the two components of T − e. The congestion of T is the maximum congestion over all edges in T . The spanning tree congestion of G is the minimum congestion over all its spanning trees. In this paper, we determine the spanning tree congestion of the rook’s graph Km Kn...
متن کاملSpanning tree congestion of some product graphs
We estimate spanning tree congestion for cartesian products of paths and complete graphs.
متن کاملSpanning tree congestion: duality and isoperimetry. With an application to multipartite graphs
In this paper we (1) Describe two approaches to estimates of the spanning tree congestion from below; (2) Use the isoperimetric approach to find the exact value of the spanning tree congestion of complete multipartite graphs; (3) Present a proof of the isoperimetric result of Piliposyan-Muradyan for complete multipartite graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 309 شماره
صفحات -
تاریخ انتشار 2009